Many entanglement distillation schemes use either universal random hashing orbreeding as their final step to obtain almost perfect shared EPR pairs. Inspite of a high yield, the hardness of decoding a random linear code makes theuse of random hashing and breeding infeasible in practice. In this pilot study,we analyze the performance of the recurrence method, a well-known entanglementdistillation scheme, with its final random hashing or breeding procedure beingreplaced by various efficiently decodable quantum codes. Among all thereplacements investigated, the one using a certain adaptive quantum low densityparity check (QLDPC) code is found to give the highest yield for Werner statesover a wide range of noise level --- the yield for using this QLDPC code ishigher than the first runner up by more than 25\% over a wide parameter range.In this respect, the effectiveness of using QLDPC codes in practicalentanglement distillation is illustrated.
展开▼
